Fully Dynamic Transitive Closure in Plane Dags with one Source and one Sink
نویسندگان
چکیده
منابع مشابه
Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink
We give an algorithm for the Dynamic Transitive Closure Problem for planar directed acyclic graphs with one source and one sink. The graph can be updated in logarithmic time under arbitrary edge insertions and deletions that preserve the embedding. Queries of the form ‘is there a directed path from u to v?’ for arbitrary vertices u and v can be answered in logarithmic time. The size of the data...
متن کاملFully Dynamic Biconnectivity and Transitive Closure
This paper presents an algorithm for the fully dynamic biconnectivity problem whose running time i s exponentially faster than all previously known solutions. It is the first dynamic algorithm that answers biconnectivity queries in time O(log2n) in a n-node graph and can be updated after an edge insertion or deletion in polylogarithmic time. Our algorithm is a LasVegas style randomized algorith...
متن کاملFully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier
In this paper we introduce a general framework for casting fully dynamic transitive closure into the problem of reevaluating polynomials over matrices. With this technique, we improve the best known bounds for fully dynamic transitive closure. In particular, we devise a deterministic algorithm for general directed graphs that achieves O(n2) amortized time for updates, while preserving unit wors...
متن کاملFully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs
This paper presents the first fully dynamic algorithms for maintaining all-pairs shortest paths in digraphs with positive integer weights less than b. For approximate shortest paths with an error factor of (2 + ), for any positive constant , the amortized update time isO(n2 log n= log logn); for an error factor of (1 + ) the amortized update time is O(n2 log3(bn)= 2). For exact shortest paths t...
متن کاملA Fully Integrated Method for Dynamic Rock Type Characterization Development in One of Iranian Off-Shore Oil Reservoir
Rock selection in modeling and simulation studies is usually based on two techniques; routinely defined rock types and those defined by special core analysis (SCAL). The challenge in utilizing these two techniques is that they are frequently assumed to be the same, but in practice, static rock-types (routinely defined) are not always representative of dynamic rock-types (SCAL defined) in the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1994
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v1i30.21613